- intersecting edge
- <docu> (technical drawing) ■ Schnittkante f
English-german technical dictionary. 2013.
intersecting edge
Schlagen Sie auch in anderen Wörterbüchern nach:
New Edge — was a styling theme used by Ford Motor Company for many of its passenger vehicles in the late 1990s and early 2000s and initially authored by Jack Telnack, who served as Vice President of Design for Ford from 1980 to 1997. Under Telnack s… … Wikipedia
Burr (edge) — Metal burr extending beyond the edge of the cut piece, view on the cut face (top) and from the bottom (bottom) A burr is a raised edge or small pieces of material remaining attached to a workpiece after a modification process.[1] It is usually an … Wikipedia
Polygon — For other uses, see Polygon (disambiguation). Some polygons of different kinds In geometry a polygon ( … Wikipedia
Tetrahedron — For the academic journal, see Tetrahedron (journal). Regular Tetrahedron (Click here for rotating model) Type Platonic solid Elements F = 4, E = 6 V = 4 (χ = 2) Faces by s … Wikipedia
New York State Route 31 — NY 31 redirects here. NY 31 may also refer to New York s 31st congressional district. NYS Route 31 … Wikipedia
New York State Route 22 — NY 22 redirects here. NY 22 may also refer to New York s 22nd congressional district. NYS Route 22 … Wikipedia
combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… … Universalium
India — /in dee euh/, n. 1. Hindi, Bharat. a republic in S Asia: a union comprising 25 states and 7 union territories; formerly a British colony; gained independence Aug. 15, 1947; became a republic within the Commonwealth of Nations Jan. 26, 1950.… … Universalium
U.S. Route 20 in New York — This article is about the section of U.S. Route 20 in New York. For the entire length of the highway, see U.S. Route 20. U.S. Route 20 Map of New York with U … Wikipedia
Median graph — The median of three vertices in a median graph In mathematics, and more specifically graph theory, a median graph is an undirected graph in which any three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest… … Wikipedia
Eulerian path — In graph theory, an Eulerian path is a path in a graph which visits each edge exactly once. Similarly, an Eulerian circuit is an Eulerian path which starts and ends on the same vertex. They were first discussed by Leonhard Euler while solving the … Wikipedia
